Complexity of Fuzzy Probability Logics
نویسندگان
چکیده
The satisfiability problem for the logic FP(Ł) (fuzzy probability logic over Łukasiewicz logic) is shown to be NP-complete; satisfiability in FP(ŁΠ) (the same over the logic joining Łukasiewicz and product logic) is shown to be in PSPACE.
منابع مشابه
EQ-logics with delta connective
In this paper we continue development of formal theory of a special class offuzzy logics, called EQ-logics. Unlike fuzzy logics being extensions of theMTL-logic in which the basic connective is implication, the basic connective inEQ-logics is equivalence. Therefore, a new algebra of truth values calledEQ-algebra was developed. This is a lower semilattice with top element endowed with two binary...
متن کاملFuzzy Reasoning and the Logics of Uncertainty
This paper is concerned with the foundations of fuzzy reasoning and its relationships with other logics of uncertainty. The definitions of fuzzy logics are first examined and the role of fuzzification discussed. It is shown that fuzzification of PC gives a known multivalued logic but with inappropriate semantics of implication and various alternative forms of implication are discussed. In the m...
متن کاملReasoning about uncertainty of fuzzy events: an overview∗
Similarly to many areas of Artificial Intelligence, Logic as well has approached the definition of inferential systems that take into account elements from real-life situations. In particular, logical treatments have been trying to deal with the phenomena of vagueness and uncertainty. While a degree-based computational model of vagueness has been investigated through fuzzy set theory [88] and f...
متن کاملDecidable Gödel Description Logics without the Finitely-Valued Model Property
In the last few years, there has been a large effort for analyzing the computational properties of reasoning in fuzzy description logics. This has led to a number of papers studying the complexity of these logics, depending on the chosen semantics. Surprisingly, despite being arguably the simplest form of fuzzy semantics, not much is known about the complexity of reasoning in fuzzy description ...
متن کاملGödel Description Logics with General Models
In the last few years, the complexity of reasoning in fuzzy description logics has been studied in depth. Surprisingly, despite being arguably the simplest form of fuzzy semantics, not much is known about the complexity of reasoning in fuzzy description logics using the Gödel t-norm. It was recently shown that in the logic G-IALC under witnessed model semantics, all standard reasoning problems ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Fundam. Inform.
دوره 45 شماره
صفحات -
تاریخ انتشار 2001